منابع مشابه
A non-parametric heuristic algorithm for convex and non-convex data clustering based on equipotential surfaces
0957-4174/$ see front matter 2009 Elsevier Ltd. A doi:10.1016/j.eswa.2009.10.019 * Corresponding author. Tel.: +98 2177240487; fax E-mail addresses: [email protected] (F. Bayat), eade [email protected] (A.A. Jalali), [email protected] In this paper, using the concepts of field theory and potential functions a sub-optimal non-parametric algorithm for clustering of convex and non-convex da...
متن کاملDissections of Polygons into Convex Polygons
In the paper we present purely combinatorial conditions that allow us to recognize the topological equivalence (or non-equivalence) of two given dissections. Using a computer program based on this result, we are able to generate a set which contains all topologically non-equivalent dissections of a p0-gon into convex pi-gons, i = 1, ..., n, where n, p0, ..., pn are integers such that n ≥ 2, pi ...
متن کاملConvexity of Sub-polygons of Convex Polygons
A convex polygon is defined as a sequence (V0, . . . , Vn−1) of points on a plane such that the union of the edges [V0, V1], . . . , [Vn−2, Vn−1], [Vn−1, V0] coincides with the boundary of the convex hull of the set of vertices {V0, . . . , Vn−1}. It is proved that all sub-polygons of any convex polygon with distinct vertices are convex. It is also proved that, if all sub-(n − 1)-gons of an n-g...
متن کاملAlgorithm for Graph Visibility Obtainment from a Map of Non-convex Polygons
Visibility graphs are basic planning algorithms,widely used in mobile robotics and other disciplines. The construction of a visibility graph can be considered a tool based on geometry that provides support to planning strategies in mobile robots. Visually, the method is used to solve that planning, which is quite extended due to the simplicity of operating with polygons, that represent obstacle...
متن کاملA modeless convex hull algorithm for simple polygons
We present an order n algorithm which computes the convex hull of a two-dimensional non-selfintersecting polygon. The algorithm recovers much of the simplicity of the one presented by Sklansky (Sklansky, 1972), and subsequently disproved. Unlike several algorithms which have been found since then, the modified algorithm executes a truly uniform (modeless) traversal of all the vertices of the po...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ITM Web of Conferences
سال: 2016
ISSN: 2271-2097
DOI: 10.1051/itmconf/20160801008